Method of operation for a configurable number theoretic transform (NTT) butterfly circuit for homomorphic encryption

ABSTRACT

Fully homomorphic encryption integrated circuit (IC) chips, systems and associated methods are disclosed. In one embodiment, a method of operation for a number theoretic transform (NTT) butterfly circuit is disclosed. The (NTT) butterfly circuit includes a high input word path cross-coupled with a low word path. The high input word path includes a first adder/subtractor, and a first multiplier. The low input word path includes a second adder/subtractor, and a second multiplier. The method includes selectively bypassing the second adder/subtractor and the second multiplier, and reconfiguring the low and high input word paths into different logic processing units in response to different mode control signals.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation that claims priority to U.S. patentapplication Ser. No. 16/921,028, entitled A CONFIGURABLE NUMBERTHEORETIC TRANSFORM (NTT) BUTTERFLY CIRCUIT FOR HOMOMORPHIC ENCRYPTION,filed Jul. 6, 2020, which is a Continuation that claims priority to U.S.patent application Ser. No. 16/654,463, entitled A METHOD OF OPERATIONFOR A CONFIGURABLE NUMBER THEORETIC TRANSFORM (NTT) BUTTERFLY CIRCUITFOR HOMOMORPHIC ENCRYPTION, filed Mar. 26, 2019, now U.S. Pat. No.10,715,309, which is a Continuation that claims priority to U.S. patentapplication Ser. No. 15/674,864, entitled HOMOMORPHIC PROCESSING UNIT(HPU) FOR ACCELERATING SECURE COMPUTATIONS UNDER HOMOMORPHIC ENCRYPTION,filed Aug. 11, 2017, now U.S. Pat. No. 10,298,385, which is aNon-Provisional that claims priority to U.S. Provisional Application No.62/484,304, filed Apr. 11, 2017, entitled A HOMOMORPHIC PROCESSING UNIT(HPU) FOR ACCELERATING SECURE COMPUTATIONS UNDER FULLY HOMOMORPHICENCRYPTION, all of which are incorporated herein by reference in theirentirety.

TECHNICAL FIELD

The disclosure herein relates to hardware accelerators, and moreparticularly homomorphic hardware accelerators and associated methods.

BACKGROUND

Fully homomorphic encryption provides the ability for a third party tocarry out computations on encrypted data without having to first decryptthe data. This form of encryption allows users to store their privateencrypted data on, for example, a remote server, while enabling the datastorage facility to process the encrypted data. Fully homomorphicencryption lends itself well to a cloud-based computing environment.

While offering great promise by preserving privacy for data owners,operations involving encrypted data are neverthelesscomputation-intensive.

SUMMARY

Homomorphic processor chips, systems and associated methods aredisclosed. In one embodiment, an integrated circuit (IC) homomorphicprocessor chip is disclosed. The IC homomorphic processor chip includesat least one processor slice. Each processor slice includes localcontrol circuitry, a number theoretic transform (NTT) butterfly unit,and on-chip memory. The NTT butterfly unit is responsive to the localcontrol circuitry to operate in multiple modes for performing operationson encrypted data using homomorphic encryption. Each mode is associatedwith a different configuration of the NTT butterfly unit.

In another embodiment, the NTT butterfly unit is responsive to the localcontrol circuitry to operate in multiple modes for operations involvingfully homomorphic encryption.

In yet another embodiment, the NTT butterfly unit is responsive to thelocal control circuitry to operate in multiple modes for operationsinvolving partially homomorphic encryption.

In another embodiment, a first configuration for the NTT butterfly unitemploys first circuitry to carry out a first ciphertext (Ctxt) function.A second configuration for the NTT butterfly unit reuses at least aportion of the first circuitry to carry out a second Ctxt function.

In another embodiment, the first circuitry carries out a ciphertext(C_(txt)) addition function while the second C_(txt) function comprisesa C_(txt) multiplication function.

In yet another embodiment, the first circuitry includes a modular adder.

In another embodiment, the modular adder comprises a combinationalmodular adder.

In another embodiment, the modular adder comprises a sequential modularadder.

In yet another embodiment, the second configuration includes secondcircuitry comprising a modular multiplier.

In a further embodiment, the modular multiplier comprises a parallelinteger multiplier.

In another embodiment, the modular multiplier further comprises amodular reduction unit.

In yet another embodiment, the IC homomorphic processor includesmultiple processor slices and the IC homomorphic processor furtherincludes master control circuitry to interface the multiple processorslices with external memory via an external processor interface.

In a further embodiment, the local control circuitry receivesinstructions from the master control circuitry to retrieve a set of Ctxtcoefficient values from the memory. The set of values is then loadedinto a processing pipeline. At least one Ctxt operation is performed togenerate transformed values. The transformed values are then stored to adestination memory location.

In another embodiment, the instructions from the master controlcircuitry further include instructions to perform NTT transformations onthe loaded set of values to generate corresponding transformed values inthe NTT domain.

In a further embodiment, the instructions from the master controlcircuitry to perform at least one Ctxt operation includes instructionsto perform at least one Ctxt operation from the group consisting ofaddition operation, subtraction operation, multiplication operation, XORoperation, XNOR operation, AND operation, equality operation, smallerthan operation, larger than operation, identity operation, copyoperation and negation operation.

In yet another embodiment, the NTT butterfly unit is realized as asingle-stage unit.

In a further embodiment, a homomorphic encryption system is disclosed.The homomorphic encryption system includes an integrated circuit (IC)homomorphic processor chip, and main memory external to the IChomomorphic processor chip. A data path transfers data between the mainmemory and the IC homomorphic processor chip. A control path controlsthe transfers between the main memory and the IC homomorphic processorchip. The IC homomorphic processor chip includes master controlcircuitry and multiple processor slices. The master control circuitrycontrols the transfers of data between the main memory and the IChomomorphic processor chip via the control path. The multiple processorslices correspond to a pipeline depth. Each of the multiple processorslices include local control circuitry, a number theoretic transform(NTT) butterfly unit, and on-chip memory. The NTT butterfly unit isresponsive to the local control circuitry to operate in multiple modesfor performing operations on encrypted data using homomorphicencryption. Each mode is associated with a different configuration ofthe NTT butterfly unit. The on-chip memory is coupled to the localcontrol circuitry and the NTT butterfly unit.

In another embodiment, the homomorphic encryption comprises fullyhomomorphic encryption.

In yet another embodiment, the homomorphic encryption comprisespartially homomorphic encryption.

In a further embodiment, the master control circuitry schedulesoperations for each of the multiple processor slices to retrieve a setof Ctxt coefficient values from the external memory and load the set ofvalues into a processing pipeline. At least one Ctxt operation isperformed to generate transformed values. The transformed values arethen stored to a destination memory location.

In another embodiment, the scheduled operations from the master controlcircuitry further include scheduled operations for each of the multipleprocessor slices to perform NTT transformations on the loaded set ofvalues to generate corresponding transformed values in the NTT domain.

In yet another embodiment, the scheduled operations from the mastercontrol circuitry further comprises scheduled operations for each of themultiple processor slices to perform at least one Ctxt operation fromthe group consisting of addition operation, subtraction operation,multiplication operation, XOR operation, XNOR operation, AND operation,equality operation, smaller than operation, larger than operation,identity operation, copy operation and negation operation.

In another embodiment, each of the NTT butterfly units comprises asingle-stage butterfly, and a given NTT transformation operationinvolves an initial NTT step followed by log₂(n)−1 stages of evaluationby the NTT butterfly unit, where “n” represents a degree of a polynomialassociated with the coefficient values.

In yet another embodiment, a number theoretic transform (NTT) butterflycircuit is disclosed. The NTT butterfly circuit includes a high inputword path including a first adder/subtractor, a first multiplier, andfirst selection circuitry. The first selection circuitry is coupled tothe first adder/subtractor and the first multiplier and includesrespective bypass paths to selectively bypass the first adder/subtractorand the first multiplier. The NTT butterfly circuit includes a low inputword path including a second adder/subtractor, a second multiplier, andsecond selection circuitry. The second selection circuitry is coupled tothe second adder/subtractor and the second multiplier and includesrespective bypass paths to selectively bypass the secondadder/subtractor and the second multiplier. The high and low input wordpaths are cross-coupled, and the first and second selection circuitry isresponsive to different mode control signals to reconfigure the low andhigh input word paths into different logic processing units.

In a further embodiment, a first configuration for the NTT butterflycircuit employs first circuitry to carry out a ciphertext (Ctxt)addition function, and a second configuration for the NTT butterflycircuit reuses at least a portion of the first circuitry to carry out aCtxt multiplication function.

In yet another embodiment, each of the first and secondadder/subtractors comprises a combinational modular adder.

In another embodiment, each of the first and second multiplierscomprises a parallel integer multiplier.

In a further embodiment, each of the first and second multipliersfurther includes a modular reduction unit.

In yet another embodiment, each of the first and secondadder/subtractors and multipliers includes associated critical paths,and each of the associated critical paths is bounded by registercircuitry.

In another embodiment, the NTT butterfly circuit is realized as asingle-stage butterfly, and a given NTT transformation operationinvolves an initial NTT step followed by log₂(n)−1 stages of evaluationby the NTT butterfly circuit, where “n” represents a degree of apolynomial associated with the coefficient values.

In a further embodiment, a method of operation in a homomorphicprocessor integrated circuit (IC) chip is disclosed. The method includestransforming ciphertext (Ctxt) symbols into a number theoretic transform(NTT) domain. The transforming includes, for a given processor slice,generating a mode control signal with local control circuitry. The modecontrol signal corresponds to one of multiple modes of operationsinvolving homomorphic encryption. The NTT butterfly unit is configuredin response to the mode control signal.

In yet another embodiment, the homomorphic encryption comprises fullyhomomorphic encryption.

In another embodiment, the homomorphic encryption comprises partiallyhomomorphic encryption.

In a further embodiment, the mode control signal comprises a first modecontrol signal corresponding to a first mode of operation, and the NTTbutterfly unit responds to the first mode control signal by configuringthe NTT butterfly unit to carry out a Ctxt addition function.

In another embodiment, the mode control signal includes a second modecontrol signal corresponding to a second mode of operation, and whereinthe NTT butterfly unit responds to the second mode control signal byconfiguring the NTT butterfly unit to carry out a Ctxt multiplicationfunction. A portion of the NTT butterfly unit employed in the additionfunction is reused to carry out the multiplication function.

In another embodiment, the transforming includes operating multipleprocessor slices in parallel, such that each processor slice includes acopy of the local control circuitry and a copy of the NTT butterflyunit.

In yet another embodiment, the method further includes pipeliningmultiple operations carried out by the multiple processor slices.

In a further embodiment, the method further includes interfacing themultiple processor slices with external memory via an external processorinterface, the interfacing controlled by master control circuitry.

In yet another embodiment, the master control circuitry generatesinstructions for the local control circuitry of the multiple slices. Thelocal control circuitry responds to the instructions to carry out stepsincluding retrieving a set of Ctxt coefficient values from the memory;loading the set of values into a processing pipeline; performing atleast one Ctxt operation to generate transformed values; and storing thetransformed values to a destination location in the external memory.

In another embodiment, the method further includes performing NTTtransformations on the loaded set of values to generate correspondingtransformed values in the NTT domain.

In yet another embodiment, the at least one Ctxt operation is selectedfrom the group consisting of addition operation, subtraction operation,multiplication operation, XOR operation, XNOR operation, AND operation,equality operation, smaller than operation, larger than operation,identity operation, copy operation and negation operation.

In a further embodiment, a method of operation in a homomorphicencryption system is disclosed. The method includes providing ahomomorphic processor integrated circuit (IC) chip including aconfigurable number theoretic transform (NTT) butterfly unit. Thehomomorphic processor IC chip interfaces with external memory via a datapath and a control path. Ciphertext (Ctxt) symbols are transformed intoan NTT domain. The transforming includes, for a given processor slice,generating a mode control signal with local control circuitry. The modecontrol signal corresponds to one of multiple modes of operationsinvolving homomorphic encryption. The NTT butterfly unit is configuredin response to the mode control signal.

In yet another embodiment, the homomorphic encryption comprises fullyhomomorphic encryption.

In a further embodiment, the homomorphic encryption comprises partiallyhomomorphic encryption.

In another embodiment, the mode control signal comprises a first modecontrol signal corresponding to a first mode of operation, and the NTTbutterfly unit responds to the first mode control signal by configuringthe NTT butterfly unit to carry out a Ctxt addition function.

In yet another embodiment, the mode control signal comprises a secondmode control signal corresponding to a second mode of operation, and theNTT butterfly unit responds to the second mode control signal byconfiguring the NTT butterfly unit to carry out a Ctxt multiplicationfunction. A portion of the NTT butterfly unit employed in the additionfunction is reused to carry out the multiplication function.

In another embodiment, the transforming includes operating multipleprocessor slices in parallel, such that each processor slice includes acopy of the local control circuitry and a copy of the NTT butterflyunit.

In another embodiment, the method further includes pipelining multipleoperations carried out by the multiple processor slices.

In yet another embodiment, the method further includes interfacing themultiple processor slices with external memory via an external processorinterface, the interfacing controlled by master control circuitry.

In another embodiment, the master control circuitry generatesinstructions for the local control circuitry of the multiple slices. Thelocal control circuitry responds to the instructions to carry out stepsincluding retrieving a set of Ctxt coefficient values from the memory;loading the set of values into a processing pipeline; performing atleast one Ctxt operation to generate transformed values; and storing thetransformed values to a destination location in the external memory.

In another embodiment, the method further includes performing NTTtransformations on the loaded set of values to generate correspondingtransformed values in the NTT domain.

In yet another embodiment, the at least one Ctxt operation is selectedfrom the group consisting of addition operation, subtraction operation,multiplication operation, XOR operation, XNOR operation, AND operation,equality operation, smaller than operation, larger than operation,identity operation, copy operation and negation operation.

In another embodiment, a method of operation in a number theoretictransform (NTT) butterfly circuit is disclosed. The circuit includes ahigh input word path and a low input word path. The high input word pathincludes a first adder/subtractor, and a first multiplier. The low inputword path includes a second adder/subtractor, and a second multiplier.The method includes selectively bypassing the second adder/subtractorand the second multiplier; and reconfiguring the low and high input wordpaths into different logic processing units in response to differentmode control signals.

In a further embodiment, the reconfiguring includes, in response toreceiving a first mode control signal, configuring the NTT butterflycircuit to carry out a ciphertext (Ctxt) addition function, and, inresponse to receiving a second mode control signal, configuring the NTTbutterfly circuit to carry out a Ctxt multiplication function.

In another embodiment, the method further includes employing acombinational modular adder for each of the first and secondadder/subtractors.

In yet another embodiment, the method further includes employing aparallel integer multiplier for each of the first and secondmultipliers.

In a further embodiment, each of the first and second multipliersincludes a reduction unit, and the method further includes operatingeach reduction unit.

In another embodiment, the NTT butterfly circuit is realized as asingle-stage butterfly, and the transforming includes operating the NTTbutterfly circuit through an initial NTT stage of evaluation followed bylog₂(n)−1 stages of evaluation, where “n” represents a degree of apolynomial associated with coefficient values.

In yet another embodiment, a homomorphic processor integrated circuit(IC) chip is disclosed. The IC homomorphic processor chip includes atleast one processor slice. The at least one processor slice includeslocal control circuitry, an NTT butterfly unit, and on-chip memory. Theon-chip memory is coupled to the control circuitry and the NTT butterflyunit and is partitioned into separately accessible storage units forhomomorphic processing functions. The on-chip memory includes multipleinput/output (I/O) storage units, a bit decomposed polynomial storageunit, and a twiddle factor memory unit.

In another embodiment, a first one of the I/O storage units storesciphertexts (Ctxts) in a row-by-row format, and a second one of the I/Ostorage units stores Ctxts in a column-by-column format.

In yet another embodiment, a third one of the I/O storage units storesoutput Ctxts resulting from a multiplication operation involving a firstCtxt from the first storage unit multiplied with a second Ctxt from thesecond storage unit.

In a further embodiment, the homomorphic processor integrated circuit(IC) chip further includes a memory counter coupled to the second memoryunit.

In another embodiment, a single row transformation of a Ctxt in a givenrow of the first one of the I/O storage units results in a correspondingresulting row in the third one of the I/O storage units.

In yet another embodiment, one of the multiple I/O storage units isconfigured as a ping-pong memory coupled to an external memory.

In a further embodiment, the ping-pong memory includes a first sub-arrayto carry out a first memory operation, and a second sub-array to carryout a second operation concurrent with the first memory operation.

In another embodiment, the on-chip memory comprises DRAM.

In a further embodiment, a method of operation in a homomorphicprocessor integrated circuit (IC) chip is disclosed. The method includespartitioning on-chip memory into separately accessible storage units forhomomorphic processing functions. The on-chip memory includes multipleinput/output (I/O) storage units, a bit decomposed polynomial storageunit, and a twiddle factor memory unit. At least one ciphertext (Ctxt)operation is performed on a loaded set of values with a configurablenumber theoretic transform (NTT) butterfly unit coupled to thepartitioned on-chip memory.

In another embodiment, the method further includes transforming theloaded set of values to generate corresponding transformed values in theNTT domain.

In another embodiment, the at least one Ctxt operation is selected fromthe group consisting of addition operation, subtraction operation,multiplication operation, XOR operation, XNOR operation, AND operation,equality operation, smaller than operation, larger than operation,identity operation, copy operation and negation operation.

In a further embodiment, the transforming further includes reading afirst ciphertext (Ctxt) from a first one of the I/O storage units in arow-by-row format, and reading a second Ctxt from a second one of theI/O storage units in a column-by-column format.

In another embodiment, the transforming further includes multiplying thefirst Ctxt with the second Ctxt to generate a resulting Ctxt, andwriting the resulting Ctxt into a third one of the I/O storage units.

In a further embodiment, one of the multiple I/O storage units includesrespective first and second sub-arrays configured as a ping-pong memoryunit. The method further includes operating the first sub-array to carryout a first operation, and operating the second sub-array to carry out asecond operation concurrent with the first operation.

In another embodiment, a method of operation in a homomorphic processorintegrated circuit (IC) chip is disclosed. The method includesretrieving a first ciphertext (Ctxt) from a first on-chip memory unitvia a row format read operation. The first Ctxt is transformed into anumber theoretic transform (NTT) domain. A second ciphertext (Ctxt) isretrieved from a second on-chip memory unit via a column format readoperation. The second Ctxt is transformed into the NTT domain. Thetransformed first Ctxt is multiplied with the transformed second Ctxt togenerate a resulting Ctxt. The resulting Ctxt is stored in a thirdmemory unit.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the disclosure are illustrated by way of example, and notby way of limitation, in the figures of the accompanying drawings and inwhich like reference numerals refer to similar elements and in which:

FIG. 1A illustrates one embodiment of a homomorphic encryption system.

FIG. 1B illustrates an embodiment of a system similar to FIG. 1A.

FIG. 1C illustrates a further embodiment of a system similar to FIG. 1A.

FIG. 2 illustrates further detail of the homomorphic encryption systemshown in FIG. 1 .

FIG. 3 illustrates one embodiment of the configurable NTT/INTT unit ofFIG. 2 .

FIG. 4 shows a timing diagram of a forward NTT operation performed bythe system of FIG. 2 .

FIG. 5 shows a timing diagram of an inverse NTT (INTT) operationperformed by the system of FIG. 2 .

FIG. 6 illustrates a timing diagram of a multiply and accumulateoperation.

FIG. 7 illustrates a matrix row column multiply operation thatcorresponds to the timing diagram of FIG. 6 .

FIG. 8 illustrates one embodiment of a flow chart relating to flowcontrol for the configurable NTT/INTT unit of FIG. 2 .

FIG. 9 illustrates a configuration of the NTT/INTT unit in a standardbutterfly mode of operation.

FIG. 10 illustrates a configuration of the NTT/INTT unit in anadd/subtract mode of operation.

FIG. 11 illustrates a configuration of the NTT/INTT unit in a matrixmultiply mode of operation.

FIG. 12 illustrates a configuration of the NTT/INTT unit in a copy modeof operation.

FIG. 13 illustrates use of an NTT butterfly unit in one embodiment of apartially homomorphic context.

DETAILED DESCRIPTION

Hardware accelerators and associated methods are disclosed. In oneembodiment, an integrated circuit (IC) homomorphic processor chip fortransforming ciphertext (C_(txt)) symbols into a number theoretictransform (NTT) domain is disclosed. The IC homomorphic processor chipincludes at least one processor slice. Each processor slice includeslocal control circuitry, NTT butterfly unit, and on-chip memory. The NTTbutterfly unit is responsive to the local control circuitry to operatein multiple modes for operations involving fully homomorphic encryption.Each mode is associated with a different configuration of the NTTbutterfly unit. By utilizing reconfigurable NTT butterfly unit, separatecircuits to accomplish the different functions may be avoided,contributing to more efficient cycle times.

Referring to FIG. 1A, one embodiment of a fully homomorphic encryption(FHE) system, generally designated 100, employs an integrated circuit(IC) homomorphic processing unit (HPU) 102. The HPU 102 includes anon-chip ciphertext (Ctxt) add/subtract unit 104, and a multiplier unit106. A Number Theoretic Transform (NTT) unit 108 assists in the Ctxtmultiplication. For one embodiment, the add/subtract unit 104, themultiplier unit 106, and the NTT unit cooperate to form amultifunctional butterfly unit 206. Embedded memory 110 is provided tofeed data to the computing engines in an optimal fashion. In addition,the system 100 employs a control unit 112 to orchestrate engineoperation and to control data transfers to and from an external memory114. This general architecture provides a cycle accurate homomorphicprocessing unit (HPU) that offers hardware acceleration for thecomputation of homomorphic operations (for Ring-based FHE encryptionschemes) faster than current state-of-the-art GPUs by, for example, 57×(based on various parameters) using a fraction of the die area exhibitedby conventional schemes, such as graphics processing units (GPUs).

For some embodiments, the multifunctional butterfly unit 206 may takedifferent forms to perform different functions, depending on theapplication. FIG. 1B illustrates the multifunctional butterfly unit 206as including NTT/INTT unit 108, and Ctxt Operation circuitry 109 tocarry out at least one of a variety of Ctxt operations. Examples of suchoperations include addition, subtraction, multiplication, XOR, XNOR,AND, equality, smaller than, larger than, identity, copy, and negation.

In one embodiment, illustrated in FIG. 1C, the multifunctional butterflyunit 206 includes the Ctxt Operation circuitry 109 to carry out at leastone of the variety of Ctxt operations noted above.

FIG. 2 illustrates further detail of one specific embodiment of an FHEsystem, generally designated 200, that corresponds to the system shownin FIG. 1 . The system 200 includes an integrated circuit (IC) chip 201,such as an application specific integrated circuit (ASIC) formed withmultiple “slices” of logic 202 a-202 n that are capable of operating inparallel to maximize processing speed and efficiency. Each slice, suchas at 202 a, defines a homomorphic processing unit (HPU) core block witha multifunctional NTT butterfly unit 206. The multifunctional butterflyunit 206 is reconfigurable, and controlled by distributed control logicin the form of a local control unit 208. An internal embedded memoryarchitecture 210 exhibits a greatly-reduced footprint while minimizinglatency. External memory 212 interfaces with the HPU core slices 202 viaa data path 214 and a control path 216. The control path 216 includes amaster control unit 218 to orchestrate operation of the system 200 at aglobal level.

Further referring to FIG. 2 , the HPU core slices 202 may be scalable innature to make the integration of a larger system a straightforwardtask, with a much simplified master control unit 218. Core input/outputs(I/Os), such as “Port1L”, “Port1H” and “Port2L” and “Port2H” areconfigured on both sides of each HPU core slice 202. Both “H” and “L”ports are capable of being input and output ports to the HPU core slice.This is advantageous since an inverse number theoretic transform (INTT)engine, which transforms NTT-domain data into ciphertext data, may usehardware similar to the NTT hardware, but with in-place horizontalflipping. In effect, the same NTT engine may compute an INTT function ifthe output ports are used as input ports and vice versa. This alsoreduces the routing resources for an NTT engine by half, whichcorrespondingly minimizes design area and power dissipation.

Further referring to FIG. 2 , the internal embedded memory 210 isprovided to efficiently load the HPU core slice 202 in a manner thatminimizes overall chip footprint and processing latency. For oneembodiment, the internal memory 210 is partitioned in a manner that notonly minimizes the amount of on-chip memory, but also minimizesprocessing latency in the system. Generally, the partitioning involvesfour memory units Mem0 (220), Mem1 (222), Mem2 (224), and Mem3 (226) forinput/output (I/O) storage, one memory unit 228 for temporary storage of“bit decomposed” (BD) polynomials, and a twiddle factor memory unit 230.A pair of shift registers 232 and 234 connected to the memory units 220,222, 224, and 226, and are selectively coupled to the HPU high and lowinputs via multiplexers M3 and M4. One of the four I/O memory units,such as Mem0, may be configured as a dual-buffer “ping-pong” memory toeffectively hide a delay associated with ciphertext loads from theexternal memory 212. In some embodiments, the twiddle factor memory unit230 may also be configured in a ping-pong orientation.

To further aid in compensating for ciphertext load delays, the data path214 that interfaces the internal memory 210 with the external memory 212may have a width that satisfies a condition where the number of clockcycles for a Ctxt load instruction is less than the number of clockcycles to carry out a Ctxt operation, e.g., not limited to Ctxtoperations such as addition operation, subtraction operation,multiplication operation, XOR operation, XNOR operation, AND operation,equality operation, smaller than operation, larger than operation,identity operation, copy operation, negation operation. To furtherimprove performance by supplying the data path with new data every clockcycle, in one embodiment, the external memory interface employs fastdynamic random access memory (DRAM), such as that defined under any oneof the various DDRX and/or GDDRX memory standards. Operation of thesystem, including various methods carried out by the memoryarchitecture, is described further below.

FIG. 3 illustrates one specific embodiment of a multifunctionalbutterfly unit, generally designated 300, that corresponds to the NTTbutterfly unit 206 of FIG. 2 . In general, the multifunctional butterflyunit 300 provides circuitry for transforming ciphertexts (C_(txt)) intonumber theoretic transforms (NTTs). For certain embodiments, the unitmay also serve as an INTT engine to transform NTTs back to ciphertexts.Generally, a number theoretic transform (NTT) is a finite-fieldequivalent of a discrete Fourier transform (DFT). An NTT reduces thecomputational cost of polynomial multiplication from O(n²), for degree npolynomials, to O(n log(n)).

Further referring to FIG. 3 , as an essential building block, themultifunctional butterfly unit 300 generally includes two modular adders302 and 304 and two modular multipliers 306 and 308 arranged in abutterfly topology. The modular adders may be combinational orsequential, depending on the application. Generally speaking, a singleradix-2 butterfly has the general formula:Out_(L)=(T _(L)(In_(L)+In_(H)))mod qOut_(H)=(T _(H)(In_(L)−In_(H)))mod qwhere T_(L) and T_(H) are called twiddle factors, and q is the modulus.

For one embodiment, the NTT butterfly unit 300 provides forreconfigurability and reuse of various logic blocks to accomplishmultiple functions utilized in FHE encryption. The NTT butterfly unit300 thus includes the modular adder/subtractor logic 302 and 304, aswell as modular multiplier logic 306 and 308. The modularadder/subtractor unit generally consists of two parts, a regularadd/subtract unit followed by a modular reduction unit. The modularreduction operation checks if the result is more than a modulus q, incase of addition, or less than 0, in case of subtraction, and adjuststhe result accordingly. For some embodiments, parallel adders like CarryLook-Ahead, Parallel Prefix, Conditional Sum, or Carry Skip adders maybe employed.

Further referring to FIG. 3 , each of the modular multipliers 306 and308 can either be configured as a single unit or an integer multiplierfollowed by a modular reduction unit. The modular reduction unit may bein the form of a Barrett modular reduction unit, a special prime modularreduction unit, or as a single unit which unifies both units such as aMontgomery modular multiplication unit. Since the modular multiplieroccupies a large portion of the multifunctional butterfly, which may berepeated many times in certain embodiments, certain implementations maybe more desirable in certain contexts than others. For one embodiment,the use of special primes with a modulus from the Solinas primes workswell, with q=

−2^(d)+1, where

=31, d=17, and q representing the modulus. To improve the performance ofthe system, a parallel integer multiplier may be employed. With theparameters defined above, the integer multiplier results in an outputwidth of 2

=62 bits. This is twice the value of

, which is then reduced by the reduction unit back to the 31 bits.

With continued reference to FIG. 3 , the multifunctional butterfly unit300 incorporates the conceptual modular adders and modular multipliersdescribed above into respective low and high processing paths 310 and312 that are selectably cross-coupled in certain modes of operation toefficiently enable logic reusability for variousadd/subtract/multiply/copy and other computing functions. The lowprocessing path 310 includes a first stage of logic includingmultiplexer M0 and registers R0 and R8. Multiplexer M0 receives a firstinput In_(L) provided to the butterfly, and a second input fed back fromadder/subtractor 302. Register R0 receives a selected output from M0,while register R8 receives a second input Inadd_(_L). The registers R0and R8 provide a first stage of latches or registers to pipeline the lowinput signals for the NTT operations. The adder/subtractor 302 receivesvarious inputs, selected by local control logic depending on thefunction being carried out. The various inputs to the adder/subtractor302 may include the output from register R0, and a selected output fromM2 originating from register R8, or feedback from multiplier 306, or across-coupled output from register R1 (from the corresponding high path312).

Further referring to FIG. 3 , the output from the adder/subtractor 302feeds a multiplication path including one input of multiplexer M4. Abypass path 314 feeds the addition/subtraction output to outputmultiplexer M6, and also along feedback path 316 to the inputmultiplexer M0. The multiplier multiplexer M4 includes a second inputfrom a bypass path 318 that directly connects the input In_(L) to themultiplier path, bypassing the addition/subtractor path. A second stageregister R2 receives a selected output from M4, and provides it to themultiplier 306. A twiddle-factor input may also be applied to themultiplier 306 via an input T_(L) through register R4. The output of themultiplier 306 may then be fed to output multiplexer M6, and also fedback for selective input to the adder/subtractor 302 along path 320 tomultiplexer M2. A third stage register R6 receives a selected outputfrom multiplexer M6, and feeds output pad Out_(L) with the processedoutput.

With continued reference to FIG. 3 , the low path 310 described abovemay be duplicated by the high path 312, with first stage registers R1and R9 operating synchronously with registers R0 and R8, with similarpipelined timing carried out between registers R3/R2 and R7/R6. As notedabove, the low and high paths 310 and 312 are cross-coupled betweenregister R0 and multiplexer M3, and register R1 and multiplexer M2. Thecross-coupling provides for functional reconfigurability and reusabilityof available logic in the butterfly for certain modes of operation asdescribed in further detail below.

In operation, the FHE system 200 of FIG. 2 carries out computationsincluding Ctxt addition, Ctxt subtraction, Ctxt multiplication andNTT/INTT processing. For some embodiments, plaintext computations mayalso be carried out. The manner in which certain operations arescheduled and handled, more fully described below, significantlyimproves performance by minimizing latency while contributing to agreatly reduced IC chip footprint.

FIG. 4 illustrates a timing chart showing various timings associatedwith some of the general operations carried out by the system of FIG. 2. Groups of operations are shown, where each group involves a number ofidentical computations that are iteratively carried out by the multiple“slices” of the HPU logic, depending on the depth of the pipelineemployed. Clock cycle time is reflected along the x-axis, going fromleft to right, where each hexagonal operation symbol represents anoperation carried out in a single clock cycle.

Further referring to FIG. 4 , as an example of a forward NTT operation,involving a transformation of ciphertexts into the NTT domain, threemain processing functions are carried out: (1) load and multiply by aconstant, (2) NTT, and (3) final NTT and store. The first operation(load and multiply by a constant), shown at 402, generally readsmultiple polynomials from the internal memories, such as at 404, untilthe HPU core block pipeline is filled, and multiplies them by constantvalues, such as at 406. The output is then sent to the output ports,such as at 408. Note that the two cycles shown to read elements from thememory consist of one cycle to get the contents from the memory,followed by another cycle for the low and high shift registers 232 and234 of FIG. 2 . The delay per polynomial for this stage equals thepipeline depth plus two clock cycles for the load from memory operation.

With continued reference to FIG. 4 , the NTT operation, shown at 410,itself iterates on the loaded polynomials in the pipeline and performslog₂(n)−1 stages of evaluation. The delay per polynomial for this stageequals the pipeline depth. A final NTT operation, at 412, then takesplace, after which the results are stored back to the destinationmemory, at 414. The effective delay per polynomial for this last stageequals the pipeline depth minus 2 clock cycles because the loading andtransformation of the new set of polynomials starts while the previouscomputation is still in the pipeline, as demonstrated with the label“Start of New NTT”. The three main processing functions are repeateduntil all the polynomials in the Ctxt are transformed. In the case ofthe inverse NTT (INTT) transform, the main processing functions arecarried out similarly, except that the constant multiplication operationtakes place after the butterfly operations.

FIG. 5 illustrates the timing for an example of an INTT operation thatis carried out similarly to the NTT operation of FIG. 4 . In schedulingthe INTT function, three main operations are performed: (1) load andperform INTT, at 502; (2) perform INTT, at 504; and (3) multiply by aconstant and store, at 506.

While FIG. 4 illustrates the timing for an example of a forward NTToperation, FIG. 6 illustrates a timing chart for a ciphertextmultiplication operation involving the multiplication of twociphertexts—Ctxt₁ and Ctxt₂. Three main processing functions are carriedout during the process: (1) NTT for the Bit Decompose of the firstpolynomial, at 602; (2) NTT for the Bit Decompose of the secondpolynomial, at 614; and (3) Multiply and Accumulate, at 618.

Further referring to FIG. 6 , the NTT for the bit decompose of the firstpolynomial, at 602, begins by reading a polynomial associated with thefirst ciphertext Ctxt₁ from memory, such as at 604. The leastsignificant bit of each integer in the polynomial is then output to thebutterfly unit, at 606. Subsequent LSB outputs involve a shift in thevalues of the high and low shift registers. At 610, the NTT transformstarts for the least significant bit, (after bypassing the additionlogic of the butterfly, at 608), including multiplication by a constantoperations and an output of the result, at 612.

With continued reference to FIG. 6 , once the result of the first BTTbit decompose is output, at 612, the NTT decompose of the secondpolynomial step, at 614 begins. A polynomial associated with the secondciphertext Ctxt₂ may then be read from memory, such as at 616, andprocessed similarly to how the first ciphertext Ctxt₁ was processed.

In the third step, involving the multiply and accumulate operation, at618, a transformed row of Ctxt₁ and a transformed column of Ctxt₂ areprocessed to compute an element in a resulting Ctxt₃. This isillustrated in FIG. 7 via a matrix multiplication table, where the upperleftmost matrix, at 702, represents Ctxt₃, while the middle matrix, at704, represents Ctxt₁, and the rightmost matrix, at 706, representsCtxt₂. The third step, multiply and accumulate, at 618 of FIG. 6 , isrepeated twice to compute a row in Ctxt₃ before repeating the samemultiplication functions described above to transform another row inCtxt₁ and compute the Ctxt₃ result.

For one embodiment, the memory contents are laid out, inside the memory,such that elements along the row of the Ctxt are read first before goingto the next row. FIG. 7 shows that the elements of Ctxt₁, at 704, andCtxt₃, at 702, are read in the normal order, along the row, whereas theelements of Ctxt₂, at 706, are read along the column. This eitherinvolves rearranging the elements in a different order, or employing amemory counter to account for this situation. One embodiment employsmemory counters that count in even and odd steps. To read the firstcolumn in Ctxt₂, at 706, the even counter is first activated until allcolumn elements are read, then the odd counter is activated to fetch theelements in the second column.

The operations described above, and shown in FIGS. 6 and 7 , reflectthat a certain row in Ctxt₁ is needed only two times to create the firstrow in Ctxt₃. This means that a full memory of a capacity capable ofstoring a bit-decomposed version of Ctxt₁ is unnecessary. Instead, asingle row at a time may be transformed to compute the corresponding rowin Ctxt₃. As a result, the amount of internal embedded memory may beminimized to greatly reduce the corresponding footprint of theintegrated circuit chip.

FIG. 8 illustrates a flow chart of steps carried out by the specificmemory architecture shown in FIG. 2 to accomplish various ciphertext andplaintext functions, consistent with the description above. Generally,the homomorphic encryption used by the system 200 allows forimplementing the following general equation:

$C_{res} = {\sum\limits_{k}\left( {\prod\limits_{j}\left( {\sum\limits_{i}{\pm {C_{ijk}\left( {{or}P_{ijk}} \right)}}} \right)} \right)}$where G_(ijk) represents the different ciphertexts, and P_(ijk)represents the plaintexts. A portion of the internal memory of FIG. 2 isconfigured to store partial results associated with the equation above.

Further referring to FIG. 2 and FIG. 8 , the flow control methodemployed by the system of FIG. 2 takes advantage of the ping-pongmemories to process data in a sub-memory unit while loading the othersub-memory unit, similar to use of a dual buffer. This helps toefficiently satisfy the general equation above. The flow control methodbegins by loading one of the ping pong sub-memory units with data fromthe external memory 212 via the data path 214, at 802. The contents ofthe ping-pong memory are then copied to one of the other embeddedmemories, such as Mem2, at 804. After copying the contents, theping-pong memory is reloaded with data from the external memory 212, at806, and the ping-pong memory selection switched, at 808.

Further referring to FIG. 8 , after switching the ping-pong memoryselection, at 808, flow control continues along two concurrent paths. Afirst one of the paths involves loading one of the ping-pong memoriesfrom the external memory, at 810, then switching the memory selection,at 824.

With continued reference to FIG. 8 , concurrent with the steps carriedout by the first path above, the second path involves applying an NTTfunction to the contents of the other of the ping-pong memories, at 812.NTT bit decomposition operations are then applied to two lines of Mem2,and the results of an accumulation operation stored in Mem3, at 814. Theping-pong memory and Mem3 are then multiplied, with the result storedback to the same two lines in Mem2, at 816. A determination is thenmade, at 818, whether 2l iterations have been performed. If not, thenthe NTT bit decompose and multiplication steps are performed again. Thesub-loop iterates until 2l iterations have been performed. Once thethreshold is satisfied, then an inverse NTT operation is applied to thecontents of Mem2, at 820.

Once the INTT operation is applied, at 820, the concurrent flow pathsreturn to a single path where the ping-pong memory selection is againswitched, at 824. A determination is then made as to whether “K”ciphertexts have been multiplied, at 826. If not, then an NTT operationis applied to the ping-pong memory, at 812, and steps 814-824 repeated.If “K” ciphertexts have been multiplied, then the result is added toMem4, at 828. A determination is then made, at 830, as to whether thealgorithm is finished. If additional processing is required, then steps804-830 are repeated. Otherwise, the flow ends for the particular set ofdata.

FIGS. 9-12 illustrate how the multifunctional butterfly unit of FIG. 3may be configured in various ways to enable the computational functionsinvolving Ctxt addition, subtraction, multiplication and NTT/INTTtransforms as described above.

FIG. 9 illustrates the multifunctional butterfly unit of FIG. 3configured for a standard butterfly mode of operation (shown by the boldpaths). The connections defining the configuration are responsive tocontrol signals dispatched by the control logic, which implements thegeneral formula:Out_(L)=(T _(L)(In_(L)+In_(H)))mod q and Out_(H)=(T_(H)(In_(L)−In_(H)))mod q.This is accomplished through the generation and application ofappropriate control signals to each of multiplexers M0-M7 to allow forselection of certain specified inputs to pass to the output of eachmultiplexer. As a result, for the low path 310, M0 will pass signalIn_(L) as an input to R0. The output of R0 will be fed through M3 as aninput to the high path adder/subtractor 304, which is configured as asubtractor. The R0 output is also fed to an input to the low pathadder/subtractor 302 which is configured as an adder. The output of theadder 302 is passed by M4 as an input to R2. The output of R2 is fed tolow path multiplier 306. Twiddle factor T_(L) is fed as an input to R4,while the output of R4 is fed as a second input to the multiplier 306.The output of the multiplier 306 is fed through M6 as the input to R6.The output of R6 becomes the resulting output Out_(L) for the low path310. The high path 312 is configured similarly, with a detaileddescription of each connection omitted for purposes of brevity.

FIG. 10 illustrates the multifunctional butterfly unit 300 configuredfor an add/subtract mode of operation to implement the general formula:Out_(L)=(In_(L)±In_(add L))mod q and Out_(H)=(In_(H)±In_(add H))mod q.Control signals issued by the control logic thus configure themultiplexers in the butterfly unit 300 similar to the standard butterflymode, but such that the low and high paths 310 and 312 generally bypassthe modular multipliers 306 and 308. The low and high paths 310 and 312also do not implement cross-coupling. Moreover, for the add/subtractmode, additional inputs In_(add_L) and In_(add_H) are supplied to therespective modular adder/subtractor units 302 and 304 via registers R8and R9.

FIG. 11 illustrates the multifunctional butterfly unit 300 configuredfor a matrix multiply mode of operation to implement the generalformula:Out_(L)=(Out_(L)+In_(L) ×T _(L))mod q and Out_(H)=(Out_(H)+In_(H) ×T_(H))mod q.This configuration realizes a multiply and accumulate function thatemploys the modular adder/subtractor units 302 and 304 as adders, andthe multiplier units 306 and 308 of both low and high paths 310 and 312without cross-coupling the paths. The low path 310 involves supplyinginput In_(L) to register R2 via M4 for multiplication with twiddlefactor input T_(L), supplied via R4. The adder 302 receives the outputof the multiplier 306 via M2, and also its own output fed back to R0 viaM0. The adder output is fed through M6 to R6, where it is presented asthe output Out_(L). The high path 312 is configured similarly.

FIG. 12 illustrates the multifunctional butterfly unit 300 configuredfor a copy mode of operation to implement the general formula:Out_(L)=In_(L) and Out_(H)=In_(H)Essentially, the copy mode involves bypassing the modularadder/subtractors 302 and 304 and the modular multipliers in merelypassing the inputs In_(L) and In_(H) directly to the outputs Out_(L) andOut_(H).

The FHE system described above lends itself well as an accompanyinghardware resource to general computing and/or server platforms that mayinvolve processing of third party data. In such an environment, one ormore HPU integrated circuit chips may be installed in one or more serverunits as co-processors or hardware accelerators to carry out focusedhomomorphic processing tasks that may take place concurrent with serveroperations. With the HPU configured to handle such specific tasks, theserver processing resources may be conserved and/or freed forserver-specific tasks.

While the disclosure above discusses embodiments primarily in a fullyhomomorphic context, various concepts presented herein may be employedin partially homomorphic contexts as well. As an example, forhigh-throughput applications, it is possible to add additionalreconfigurability to the presently proposed design in order to supportpartially homomorphic cryptosystems, like the Paillier Cryptosystem.These partially homomorphic encryption schemes, like the Pailliercryptosystem, generally involve large integer multipliers, which can beimplemented, for example, using Schönhage-Strassen, Karatsuba, orToom-Cook algorithms. Without loss of generality, as an example ofinstantiating these algorithms to the HPU hardware described above, theSchönhage-Strassen algorithm uses fast polynomial multiplication toperform fast integer multiplication. To perform large integermultiplication for two input numbers “a” and “b”, we first compute thelargest integer that can possibly result from our algorithm, we thenpick an integer “w” which is larger than this largest possible result toavoid overflow. Afterwards, we split “a” and “b” into “m” groups of “w”bits as follows:

$a = {{\overset{m - 1}{\sum\limits_{i = 0}}{a_{i}2^{wi}{and}b}} = {\overset{m - 1}{\sum\limits_{j = 0}}{b_{j}{2^{wj}.}}}}$

Let x=2^(w), then the previous equation is equivalently,

$a = {{\overset{m - 1}{\sum\limits_{i = 0}}{a_{i}x^{i}{and}b}} = {\overset{m - 1}{\sum\limits_{j = 0}}{b_{j}{x^{j}.}}}}$

Then we can state that,

${ab} = {{\overset{m - 1}{\sum\limits_{i = 0}}{\overset{m - 1}{\sum\limits_{j = 0}}{a_{i}b_{j}x^{({i + j})}}}} = {\overset{{2m} - 2}{\sum\limits_{k = 0}}{c_{k}x^{k}}}}$

The above equation can be computed efficiently using an NTT unit such asthe Number Theoretic Transform (NTT) engine described herein, and shownin a partially homomorphic context in FIG. 13 . Input numbers “a” and“b” are fed to respective NTT units 1302 and 1304. The numbers undergo amultiplication operation, at 1306, followed by an INTT operation, at1308. A carry operation is then performed, at 1310, to achieve theresult “c.”

The Schönhage-Strassen algorithm described above can be efficientlyimplemented using the NTT engine described herein by partitioning theinput integers into smaller parts where each part is stored in adjacentpolynomial coefficients. Afterwards, the NTT transformation may beapplied on both polynomials and coefficient-wise multiplication will beperformed on the transformed polynomials. Finally, the result will betransformed back to the coefficient representation and a final carrypropagation will be performed.

Such implementations would find utility in accelerating a wide range ofimportant applications, for example, those found in particular securevoting systems, blockchains, secure contracts, certain multi-partycomputation (MPC) algorithms and cryptocurrencies.

Those skilled in the art will appreciate that the architecture describedabove significantly reduces the computational time to carry outhomomorphic encryption processing functions on a single integratedcircuit chip. Moreover, through efficient memory utilization, the sizeand power consumption of the chip is minimized.

When received within a computer system via one or more computer-readablemedia, such data and/or instruction-based expressions of the abovedescribed circuits may be processed by a processing identity (e.g., oneor more processors) within the computer system in conjunction withexecution of one or more other computer programs including, withoutlimitation, net-list generation programs, place and route programs andthe like, to generate a representation or image of a physicalmanifestation of such circuits. Such representation or image maythereafter be used in device fabrication, for example, by enablinggeneration of one or more masks that are used to form various componentsof the circuits in a device fabrication process.

In the foregoing description and in the accompanying drawings, specificterminology and drawing symbols have been set forth to provide athorough understanding of the present invention. In some instances, theterminology and symbols may imply specific details that are not requiredto practice the invention. For example, any of the specific numbers ofbits, signal path widths, signaling or operating frequencies, componentcircuits or devices and the like may be different from those describedabove in alternative embodiments. Also, the interconnection betweencircuit elements or circuit blocks shown or described as multi-conductorsignal links may alternatively be single-conductor signal links, andsingle conductor signal links may alternatively be multi-conductorsignal links. Signals and signaling paths shown or described as beingsingle-ended may also be differential, and vice-versa. Similarly,signals described or depicted as having active-high or active-low logiclevels may have opposite logic levels in alternative embodiments.Component circuitry within integrated circuit devices may be implementedusing metal oxide semiconductor (MOS) technology, bipolar technology orany other technology in which logical and analog circuits may beimplemented. With respect to terminology, a signal is said to be“asserted” when the signal is driven to a low or high logic state (orcharged to a high logic state or discharged to a low logic state) toindicate a particular condition. Conversely, a signal is said to be“deasserted” to indicate that the signal is driven (or charged ordischarged) to a state other than the asserted state (including a highor low logic state, or the floating state that may occur when the signaldriving circuit is transitioned to a high impedance condition, such asan open drain or open collector condition). A signal driving circuit issaid to “output” a signal to a signal receiving circuit when the signaldriving circuit asserts (or deasserts, if explicitly stated or indicatedby context) the signal on a signal line coupled between the signaldriving and signal receiving circuits. A signal line is said to be“activated” when a signal is asserted on the signal line, and“deactivated” when the signal is deasserted. Additionally, the prefixsymbol “I” attached to signal names indicates that the signal is anactive low signal (i.e., the asserted state is a logic low state). Aline over a signal name (e.g., ‘<signal name>’) is also used to indicatean active low signal. The term “coupled” is used herein to express adirect connection as well as a connection through one or moreintervening circuits or structures. Integrated circuit device“programming” may include, for example and without limitation, loading acontrol value into a register or other storage circuit within the devicein response to a host instruction and thus controlling an operationalaspect of the device, establishing a device configuration or controllingan operational aspect of the device through a one-time programmingoperation (e.g., blowing fuses within a configuration circuit duringdevice production), and/or connecting one or more selected pins or othercontact structures of the device to reference voltage lines (alsoreferred to as strapping) to establish a particular device configurationor operation aspect of the device. The term “exemplary” is used toexpress an example, not a preference or requirement.

According to an embodiment, the HPU chip may be mounted on a system in aform of a computer Card, a USB Stick, or any other form to be connectedto a computer processor.

Various aspects and features of embodiments disclosed herein are setforth, for example and without limitation, in the following numberedclauses:

1. An integrated circuit (IC) homomorphic processor chip comprising:

-   -   at least one processor slice, the slice including        -   local control circuitry;        -   a number theoretic transform (NTT) butterfly unit responsive            to the local control circuitry to operate in multiple modes            for performing operations on encrypted data using            homomorphic encryption, each mode associated with a            different configuration of the NTT butterfly unit; and        -   on-chip memory coupled to the control circuitry and the NTT            butterfly unit.            2. The IC homomorphic processor chip of clause 1, wherein            the NTT butterfly unit is responsive to the local control            circuitry to operate in multiple modes for operations            involving fully homomorphic encryption.            3. The IC homomorphic processor chip of clause 1, wherein            the NTT butterfly unit is responsive to the local control            circuitry to operate in multiple modes for operations            involving partially homomorphic encryption.            4. The IC homomorphic processor chip of clause 1, wherein:    -   a first configuration for the NTT butterfly unit employs first        circuitry to carry out a first ciphertext (C_(txt)) function;        and    -   a second configuration for the NTT butterfly unit reuses at        least a portion of the first circuitry to carry out a second        C_(txt) function.        5. The IC homomorphic processor chip of clause 4, wherein:    -   the first circuitry carries out a ciphertext (C_(txt)) addition        function; and    -   the second C_(txt) function comprises a C_(txt) multiplication        function.        6. The IC homomorphic processor chip of clause 5, wherein:    -   the first circuitry includes a modular adder.        7 The IC homomorphic processor chip of clause 6, wherein:    -   the modular adder comprises a combinational modular adder.        8. The IC homomorphic processor chip of clause 6, wherein:    -   the modular adder comprises a sequential modular adder.        9. The IC homomorphic processor chip of clause 5, wherein:    -   the second configuration includes second circuitry comprising a        modular multiplier.        10. The IC homomorphic processor chip of clause 9, wherein the        modular multiplier comprises a parallel integer multiplier.        11. The IC homomorphic processor chip of clause 10, wherein the        modular multiplier further comprises:    -   a modular reduction unit.        12. The IC homomorphic processor chip of clause 1, wherein the        IC homomorphic processor includes multiple processor slices, and        wherein the IC homomorphic processor further comprises:    -   master control circuitry to interface the multiple processor        slices with external memory via an external processor interface.        13. The IC homomorphic processor chip of clause 12, wherein the        local control circuitry receives instructions from the master        control circuitry to:    -   retrieve a set of C_(txt) coefficient values from the memory;    -   load the set of values into a processing pipeline;    -   perform at least one Ctxt operation; and    -   store the transformed values to a destination memory location.        14. The IC homomorphic processor chip of clause 13, wherein the        instructions from the master control circuitry further comprises        instructions to:    -   perform NTT transformations on the loaded set of values to        generate corresponding transformed values in the NTT domain.        15. The IC homomorphic processor chip of clause 14, wherein the        instructions from the master control circuitry to perform at        least one Ctxt operation comprises instructions to:    -   perform at least one Ctxt operation from the group consisting of        addition operation, subtraction operation, multiplication        operation, XOR operation, XNOR operation, AND operation,        equality operation, smaller than operation, larger than        operation, identity operation, copy operation and negation        operation.        16. The IC homomorphic processor chip of clause 1, wherein:    -   the NTT butterfly unit is realized as a single-stage unit.        17. A homomorphic encryption system, comprising:    -   an integrated circuit (IC) homomorphic processor chip;    -   main memory external to the IC homomorphic processor chip;    -   a data path for transferring data between the main memory and        the IC homomorphic processor chip;    -   a control path to control the transfers between the main memory        and the IC homomorphic processor chip; and    -   wherein the IC homomorphic processor chip comprises        -   master control circuitry to control the transfers of data            between the main memory and the IC homomorphic processor            chip via the control path; and        -   multiple processor slices corresponding to a pipeline depth,            each of the multiple processor slices including            -   local control circuitry;            -   a number theoretic transform (NTT) butterfly unit                responsive to the local control circuitry to operate in                multiple modes for performing operations on encrypted                data using homomorphic encryption, each mode associated                with a different configuration of the NTT butterfly                unit; and            -   on-chip memory coupled to the local control circuitry                and the NTT butterfly unit.                18. The homomorphic encryption system of clause 17,                wherein the homomorphic encryption comprises fully                homomorphic encryption.                19. The homomorphic encryption system of clause 17,                wherein the homomorphic encryption comprises partially                homomorphic encryption.                20. The homomorphic encryption system of clause 17,                wherein the master control circuitry schedules                operations for each of the multiple processor slices to:    -   retrieve a set of C_(txt) coefficient values from the external        memory;    -   load the set of values into a processing pipeline;    -   perform at least one Ctxt operation to generate transformed        values; and    -   store the transformed values to a destination memory location.        21. The homomorphic encryption system of clause 20, wherein the        scheduled operations from the master control circuitry further        comprises scheduled operations for each of the multiple        processor slices to:    -   perform NTT transformations on the loaded set of values to        generate corresponding transformed values in the NTT domain.        22. The homomorphic encryption system of clause 21, wherein the        scheduled operations from the master control circuitry further        comprises scheduled operations for each of the multiple        processor slices to:    -   perform at least one Ctxt operation from the group consisting of        addition operation, subtraction operation, multiplication        operation, XOR operation, XNOR operation, AND operation,        equality operation, smaller than operation, larger than        operation, identity operation, copy operation and negation        operation.        23. The homomorphic encryption system of clause 20, wherein:    -   each of the NTT butterfly units comprises a single-stage        butterfly; and    -   wherein a given NTT transformation operation involves log(n)−1        stages of evaluation by the NTT butterfly unit, where “n”        represents a degree of a polynomial associated with the        coefficient values.        24. A number theoretic transform (NTT) butterfly circuit        comprising:    -   a high input word path including        -   a first adder/subtractor,        -   a first multiplier, and        -   first selection circuitry coupled to the first            adder/subtractor and the first multiplier and including            respective bypass paths to selectively bypass the first            adder/subtractor and the first multiplier;    -   a low input word path including        -   a second adder/subtractor,        -   a second multiplier, and        -   second selection circuitry coupled to the second            adder/subtractor and the second multiplier and including            respective bypass paths to selectively bypass the second            adder/subtractor and the second multiplier;    -   wherein the high and low input word paths are cross-coupled, and        the first and second selection circuitry is responsive to        different mode control signals to reconfigure the low and high        input word paths into different logic processing units.        25. The NTT butterfly circuit of clause 24, wherein:    -   a first configuration for the NTT butterfly circuit employs        first circuitry to carry out a ciphertext (C_(txt)) addition        function; and    -   a second configuration for the NTT butterfly circuit reuses at        least a portion of the first circuitry to carry out a C_(txt)        multiplication function.        26. The NTT butterfly circuit of clause 24, wherein:    -   each of the first and second adder/subtractors comprises a        combinational modular adder.        27. The NTT butterfly circuit of clause 24, wherein:    -   each of the first and second multipliers comprises a parallel        integer multiplier.        28. The NTT butterfly circuit of clause 24, wherein each of the        first and second multipliers further comprises:    -   a modular reduction unit.        29. The NTT butterfly circuit of clause 24, wherein:    -   each of the first and second adder/subtractors and multipliers        includes associated critical paths; and    -   wherein each of the associated critical paths is bounded by        register circuitry.        30. The NTT butterfly circuit of clause 24, wherein:    -   the NTT butterfly circuit is realized as a single-stage        butterfly; and    -   wherein a given NTT transformation operation involves log(n)−1        stages of evaluation by the NTT butterfly circuit, where “n”        represents a degree of a polynomial associated with the        coefficient values.        31. A method of operation in a homomorphic processor integrated        circuit (IC) chip, the method comprising:    -   transforming ciphertext (Ctxt) symbols into a number theoretic        transform (NTT) domain, the transforming including, for a given        processor slice,        -   generating a mode control signal with local control            circuitry, the mode control signal corresponding to one of            multiple modes of operations involving homomorphic            encryption; and        -   configuring NTT butterfly unit in response to the mode            control signal.            32. The method of operation in a homomorphic processor IC            chip according to clause 31, wherein the homomorphic            encryption comprises fully homomorphic encryption.            33. The method of operation in a homomorphic processor IC            chip according to clause 31, wherein the homomorphic            encryption comprises partially homomorphic encryption.            34. The method according to clause 31, wherein the mode            control signal comprises a first mode control signal            corresponding to a first mode of operation, and wherein the            NTT butterfly unit responds to the first mode control signal            by:    -   configuring the NTT butterfly unit to carry out a Ctxt addition        function.        35. The method according to clause 34, wherein the mode control        signal comprises a second mode control signal corresponding to a        second mode of operation, and wherein the NTT butterfly unit        responds to the second mode control signal by:    -   configuring the NTT butterfly unit to carry out a Ctxt        multiplication function; and    -   reusing a portion of the NTT butterfly unit employed in the        addition function to carry out the multiplication function.        36. The method according to clause 31, wherein the transforming        comprises:    -   operating multiple processor slices in parallel, each processor        slice including a copy of the local control circuitry and a copy        of the NTT butterfly unit.        37. The method according to clause 36, further comprising:    -   pipelining multiple operations carried out by the multiple        processor slices.        38. The method according to clause 37, further comprising:    -   interfacing the multiple processor slices with external memory        via an external processor interface, the interfacing controlled        by master control circuitry.        39. The method according to clause 38, wherein the master        control circuitry generates instructions for the local control        circuitry of the multiple slices, the local control circuitry        responsive to the instructions to carry out the steps including:    -   retrieving a set of Ctxt coefficient values from the memory;    -   loading the set of values into a processing pipeline;    -   performing at least one Ctxt operation to generate transformed        values; and    -   storing the transformed values to a destination location in the        external memory.        40. The method according to clause 39, further comprising the        step of performing NTT transformations on the loaded set of        values to generate corresponding transformed values in the NTT        domain.        41. The method according to clause 40, wherein the at least one        Ctxt operation is selected from the group consisting of addition        operation, subtraction operation, multiplication operation, XOR        operation, XNOR operation, AND operation, equality operation,        smaller than operation, larger than operation, identity        operation, copy operation and negation operation.        42. A method of operation in a homomorphic encryption system,        the method comprising:    -   providing a homomorphic processor integrated circuit (IC) chip        including configurable number theoretic transform (NTT)        butterfly logic;    -   interfacing the homomorphic processor IC chip with external        memory via a data path and a control path; and    -   transforming ciphertext (Ctxt) symbols into an NTT domain, the        transforming including, for a given processor slice,        -   generating a mode control signal with local control            circuitry, the mode control signal corresponding to one of            multiple modes of operations involving homomorphic            encryption, and        -   configuring NTT butterfly unit in response to the mode            control signal.            43. The method of operation in a homomorphic encryption            system according to clause 42, wherein the homomorphic            encryption comprises fully homomorphic encryption.            44. The method of operation in a homomorphic encryption            system according to clause 42, wherein the homomorphic            encryption comprises partially homomorphic encryption.            44. The method according to clause 42, wherein the mode            control signal comprises a first mode control signal            corresponding to a first mode of operation, and wherein the            NTT butterfly unit responds to the first mode control signal            by:    -   configuring the NTT butterfly unit to carry out a Ctxt addition        function.        45. The method according to clause 44, wherein the mode control        signal comprises a second mode control signal corresponding to a        second mode of operation, and wherein the NTT butterfly unit        responds to the second mode control signal by:    -   configuring the NTT butterfly unit to carry out a Ctxt        multiplication function; and    -   reusing a portion of the NTT butterfly unit employed in the        addition function to carry out the multiplication function.        46. The method according to clause 42, wherein the transforming        comprises:    -   operating multiple processor slices in parallel, each processor        slice including a copy of the local control circuitry and a copy        of the NTT butterfly unit.        47. The method according to clause 46, further comprising:    -   pipelining multiple operations carried out by the multiple        processor slices.        48. The method according to clause 47, further comprising:    -   interfacing the multiple processor slices with external memory        via an external processor interface, the interfacing controlled        by master control circuitry.        49. The method according to clause 48, wherein the master        control circuitry generates instructions for the local control        circuitry of the multiple slices, the local control circuitry        responsive to the instructions to carry out the steps including:    -   retrieving a set of Ctxt coefficient values from the memory;    -   loading the set of values into a processing pipeline;    -   performing at least one Ctxt operation to generate transformed        values; and    -   storing the transformed values to a destination location in the        external memory.        50. The method according to clause 49 further comprising the        step of performing NTT transformations on the loaded set of        values to generate corresponding transformed values in the NTT        domain.        51. The method according to clause 50 wherein the at least one        Ctxt operation is selected from the group consisting of addition        operation, subtraction operation, multiplication operation, XOR        operation, XNOR operation, AND operation, equality operation,        smaller than operation, larger than operation, identity        operation, copy operation and negation operation.        52. A method of operation in a number theoretic transform (NTT)        butterfly circuit, the circuit including a high input word path        and a low input word path, the high input word path including a        first adder/subtractor, and a first multiplier, the low input        word path including a second adder/subtractor, and a second        multiplier, wherein the method comprises:    -   selectively bypassing the second adder/subtractor and the second        multiplier; and    -   reconfiguring the low and high input word paths into different        logic processing units in response to different mode control        signals.        53. The method according to clause 52, wherein the reconfiguring        comprises:    -   in response to receiving a first mode control signal,        configuring the NTT butterfly circuit to carry out a ciphertext        (C_(txt)) addition function; and    -   in response to receiving a second mode control signal,        configuring the NTT butterfly circuit to carry out a C_(txt)        multiplication function.        54. The method according to clause 52, further comprising:    -   employing a combinational modular adder for each of the first        and second adder/subtractors.        55. The method according to clause 52, further comprising:    -   employing a parallel integer multiplier for each of the first        and second multipliers.        56. The method according to clause 52, wherein each of the first        and second multipliers includes a reduction unit, and wherein        the method further comprises:    -   operating each reduction unit.        57. The NTT butterfly circuit of clause 52, wherein the NTT        butterfly circuit is realized as a single-stage butterfly, and        wherein the transforming comprises:    -   operating the NTT butterfly circuit through log(n)−1 stages of        evaluation, where “n” represents a degree of a polynomial        associated with coefficient values.        58. A homomorphic processor integrated circuit (IC) chip for        transforming ciphertext (C_(txt)) symbols into a number        theoretic transform (NTT) domain, the IC homomorphic processor        chip comprising:    -   at least one processor slice, the slice including        -   local control circuitry;        -   an NTT butterfly unit; and        -   on-chip memory coupled to the control circuitry and the NTT            butterfly unit, the on-chip memory partitioned into            separately accessible storage units for homomorphic            processing functions, the on-chip memory including            -   multiple input/output (I/O) storage units,            -   a bit decomposed polynomial storage unit, and            -   a twiddle factor memory unit.                59. The homomorphic processor IC chip according to                clause 58, wherein:    -   a first one of the I/O storage units stores ciphertexts (Ctxts)        in a row-by-row format; and    -   a second one of the I/O storage units stores Ctxts in a        column-by-column format.        60. The homomorphic processor IC chip according to clause 59,        wherein:    -   a third one of the I/O storage units stores output Ctxts        resulting from a multiplication operation involving a first Ctxt        from the first storage unit multiplied with a second Ctxt from        the second storage unit.        61. The homomorphic processor IC chip according to clause 60,        further comprising:    -   a memory counter coupled to the second memory unit.        62. The homomorphic processor IC chip according to clause 60,        wherein:    -   a single row transformation of a Ctxt in a given row of the        first one of the I/O storage units results in a corresponding        resulting row in the third one of the I/O storage units.        63. The homomorphic processor IC chip according to clause 58,        wherein:    -   one of the multiple I/O storage units is configured as a        ping-pong memory coupled to an external memory.        64. The homomorphic processor IC chip according to clause 63,        wherein the ping-pong memory includes:    -   a first sub-array to carry out a first memory operation; and    -   a second sub-array to carry out a second operation concurrent        with the first memory operation.        65. The homomorphic processor IC chip according to clause 63,        wherein the on-chip memory comprises DRAM.        66. A method of operation in a homomorphic processor integrated        circuit (IC) chip, the method comprising:    -   partitioning on-chip memory into separately accessible storage        units for homomorphic processing functions, the on-chip memory        including multiple input/output (I/O) storage units, a bit        decomposed polynomial storage unit, and a twiddle factor memory        unit; and    -   performing at least one ciphertext (Ctxt) operation on a loaded        set of values with a configurable number theoretic transform        (NTT) butterfly unit coupled to the partitioned on-chip memory.        67. The method according to clause 66, further comprising:    -   transforming the loaded set of values to generate corresponding        transformed values in the NTT domain.        68. The method according to clause 67 wherein the at least one        Ctxt operation is selected from the group consisting of addition        operation, subtraction operation, multiplication operation, XOR        operation, XNOR operation, AND operation, equality operation,        smaller than operation, larger than operation, identity        operation, copy operation and negation operation.        69. The method according to clause 67, wherein the transforming        further comprises:    -   reading a first ciphertext (Ctxt) from a first one of the I/O        storage units in a row-by-row format; and    -   reading a second Ctxt from a second one of the I/O storage units        in a column-by-column format.        70. The method according to clause 69, wherein the transforming        further comprises:    -   multiplying the first Ctxt with the second Ctxt to generate a        resulting Ctxt; and    -   writing the resulting Ctxt into a third one of the I/O storage        units.        71. The method according to clause 66, wherein one of the        multiple I/O storage units includes respective first and second        sub-arrays configured as a ping-pong memory unit, wherein the        method further comprises:    -   operating the first sub-array to carry out a first operation;        and    -   operating the second sub-array to carry out a second operation        concurrent with the first operation.        72. A method of operation in a homomorphic processor integrated        circuit (IC) chip, the method comprising:    -   retrieving a first ciphertext (Ctxt) from a first on-chip memory        unit, the first Ctxt retrieved via a row format read operation;    -   transforming the first Ctxt into a number theoretic transform        (NTT) domain;    -   retrieving a second ciphertext (Ctxt) from a second on-chip        memory unit, the second Ctxt retrieved via a column format read        operation;    -   transforming the second Ctxt into the NTT domain;    -   multiplying the transformed first Ctxt with the transformed        second Ctxt to generate a resulting Ctxt; and    -   storing the resulting Ctxt in a third memory unit.

While the invention has been described with reference to specificembodiments thereof, it will be evident that various modifications andchanges may be made thereto without departing from the broader spiritand scope of the invention. For example, features or aspects of any ofthe embodiments may be applied, at least where practicable, incombination with any other of the embodiments or in place of counterpartfeatures or aspects thereof. Accordingly, the specification and drawingsare to be regarded in an illustrative rather than a restrictive sense.

We claim:
 1. A circuit, comprising: number theoretic transform (NTT)circuitry including selection circuitry to configure the NTT circuitryinto one of a first mode of operation or a second mode of operation;wherein for the first mode of operation, the selection circuitry isresponsive to a first control signal to configure the NTT circuitry intoa first logic processing unit; and wherein for the second mode ofoperation, the selection circuitry is responsive to a second controlsignal to configure the NTT circuitry into a second logic processingunit that is different than the first logic processing unit.
 2. Thecircuit of claim 1, wherein: for the first mode of operation, the firstlogic processing unit carries out a ciphertext (C_(txt)) additionfunction; and for the second mode of operation, the second processingunit carries out a C_(txt) multiplication function.
 3. The circuit ofclaim 1, wherein the NTT circuitry further includes a high input wordpath and a low input word path, wherein: the high input word pathincludes a first adder/subtractor, a first multiplier, and wherein theselection circuitry is coupled to the first adder/subtractor and thefirst multiplier and including respective first bypass paths toselectively bypass the first adder/subtractor and the first multiplier;and the low input word path includes a second adder/subtractor, a secondmultiplier, and wherein the selection circuitry is coupled to the secondadder/subtractor and the second multiplier and including respectivesecond bypass paths to selectively bypass the second adder/subtractorand the second multiplier.
 4. The circuit of claim 3, wherein: the highand low input word paths are selectively cross-coupled.
 5. The circuitof claim 3, wherein the first adder/subtractor and the secondadder/subtractor each comprises: a regular add/subtract unit having anoutput fed to a modular reduction unit.
 6. The circuit of claim 5,wherein the regular add/subtract unit comprises a parallel adder.
 7. Thecircuit of claim 5, wherein the modular reduction unit comprises onefrom the group including: a Barrett modular reduction unit, a specialprime modular reduction unit, and a Montgomery modular multiplicationunit.
 8. The circuit of claim 3, wherein the first multiplier and thesecond multiplier each comprise: a modular adder.
 9. The circuit ofclaim 3, wherein the first multiplier and the second multiplier eachcomprise: an integer multiplier having an output fed to a modularreduction unit.
 10. The circuit of claim 9, wherein the integermultiplier comprises: a parallel integer multiplier.
 11. A circuit,comprising: number theoretic transform (NTT) circuitry includingselection circuitry responsive to a first control signal value toconfigure the NTT circuitry into a first mode of operation; and whereinthe selection circuitry is responsive to a second control signal valuethat is different than the first control signal value to configure theNTT circuitry into a second mode of operation that is different than thefirst mode of operation.
 12. The circuit of claim 11, wherein: for thefirst mode of operation, the NTT circuitry is configured into a firstlogic processing unit; and for the second mode of operation, the NTTcircuitry is configured into a second logic processing unit that isdifferent from the first logic processing unit.
 13. The circuit of claim12, wherein: for the first mode of operation, the first logic processingunit carries out a ciphertext (C_(txt)) addition function; and for thesecond mode of operation, the second processing unit carries out aC_(txt) multiplication function.
 14. The circuit of claim 11, whereinthe NTT circuitry includes: a high input word path; a low input wordpath; and wherein the selection circuitry includes bypass circuitry tobypass portions of the high input word path or the low input word pathbased on receipt of the first control signal value or the second controlsignal value.
 15. The circuit of claim 14, wherein: the high and lowinput word paths are selectively cross-coupled.
 16. The circuit of claim14, wherein: the high input word path includes a first adder/subtractor,a first multiplier, and  wherein the selection circuitry is coupled tothe first adder/subtractor and the first multiplier and wherein thebypass circuitry is to selectively bypass the first adder/subtractor andthe first multiplier; and the low input word path includes a secondadder/subtractor, a second multiplier, and  wherein the selectioncircuitry is coupled to the second adder/subtractor and the secondmultiplier and wherein the bypass circuitry is to selectively bypass thesecond adder/subtractor and the second multiplier.
 17. A method ofoperation in a homomorphic processor integrated circuit (IC) chip, themethod comprising: configuring, with a selection circuit responsive to afirst control signal value, a Number Theoretic Transform (NTT) circuitfor a first mode of operation; and configuring, with the selectioncircuit responsive to a second control signal value that is differentthan the first control signal value, the NTT circuit for a second modeof operation that is different than the first mode of operation.
 18. Themethod according to claim 17, wherein: for the first mode of operation,the configuring configures the NTT circuitry into a first logicprocessing unit; and for the second mode of operation, the configuringconfigures the NTT circuitry into a second logic processing unit that isdifferent from the first logic processing unit.
 19. The method of claim18, wherein: performing, in the first mode of operation, a ciphertext(C_(txt)) addition function with the first logic processing unit; andperforming, in the second mode of operation, a C_(txt) multiplicationfunction with the second processing unit.